Using Lexicalized Grammars and Headedness for Approximate Plan Recognition
نویسنده
چکیده
This paper presents a new algorithm for plan recognition using an action grammar formalism based on Combinatory Catagorial Grammar, that requires a significant shift in thinking about the problem of plan recognition. This approach makes significant use of the concepts of lexicalization and headedness from natural language parsing. It argues that lexicalization of action grammars can help plan recognition address a number of technical and efficiency questions, and that headedness in action grammars is previously unrecognized and an important addition to plan recognition theory in its
منابع مشابه
Recognizing Plans with Loops Represented in a Lexicalized Grammar
This paper extends existing plan recognition research to handle plans containing loops. We supply an encoding of plans with loops for recognition, based on techniques used to parse lexicalized grammars, and demonstrate its effectiveness empirically. To do this, the paper first shows how encoding plan libraries as context free grammars permits the application of standard rewriting techniques to ...
متن کاملDelaying Commitment in Plan Recognition Using Combinatory Categorial Grammars
This paper presents a new algorithm for plan recognition called ELEXIR (Engine for LEXicalized Intent Recognition). ELEXIR represents the plans to be recognized with a grammatical formalism called Combinatory Categorial Grammar(CCG).We show that representing plans with CCGs can allow us to prevent early commitment to plan goals and thereby reduce runtime.
متن کاملFixing a Hole in Lexicalized Plan Recognition
Previous work has suggested the use of lexicalized grammars for probabilistic plan recognition. Such grammars allow the domain builder to delay commitment to hypothesizing high level goals in order to reduce computational costs. However this delay has limitations. In the case of only partial observation traces, delaying commitment can prevent such algorithms from forming correct conclusions abo...
متن کاملHandling Looping and Optional Actions in YAPPR
Previous work on the YAPPR plan recognition system provided algorithms for translating conventional HTN plan libraries into lexicalized grammars and treated the problem of plan recognition as one of parsing. To produce these grammars required a fixed bound for any loops within the grammar and a presented a problem for optional actions within HTN plans. In this work we show that well known trans...
متن کاملConsidering State in Plan Recognition with Lexicalized Grammars
This paper documents extending the ELEXIR (Engine for LEXicalized Intent Recognition) system (Geib 2009; Geib and Goldman 2011) with a world model. This is a significant increase in the expressiveness of the plan recognition system and allows a number of additions to the algorithm, most significantly conditioning probabilities for recognized plans on the state of the world during execution. Sin...
متن کامل